#include <iostream>
#include <map>
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int prime[N], d, X[N], P[N];
bool isp[N];
void getprime() {
    for (int i = 2; i < N; ++ i) {
        if (!isp[i]) prime[d ++] = i;
        for (int j = 0; prime[j] * i < N; ++ j) {
            isp[i * prime[j]] = true;
            if (i % prime[j] == 0) break;
        }
    }
}
static int MOD = []() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    return 1e9 + 7;
}();
int dp[N];
int _2[100];
void solve() {
    for (int i = 3; i <= 1000000; ++ i) {
        lower_bound(_2, _2 + )
    }
}
int arr[N];
signed main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++ i) {
        cin >> arr[i];
    }
    int maxn = *max_element(arr + 1, arr + n + 1), minn = *min_element(arr + 1, arr + n + 1);
    for (int i = 1; i <= n; ++ i) {
        cout << (int)100.0 * (arr[i] - minn) / (maxn - minn) << " ";
    }cout << endl;
    return 0;
}